Computing matrix–vector products with centrosymmetric and centrohermitian matrices
نویسندگان
چکیده
منابع مشابه
Some Properties of Centrosymmetric Matrices and Its
In this paper, some properties of centrosymmetric matrices, which often appear in the construction of orthonormal wavelet basis in wavelet analysis, are investigated. As an application, an algorithm which is tightly related to a so-called Lawton matrix is presented. In this algorithm, about only half of memory units are required and quarter of computational cost is needed by exploiting the prop...
متن کاملPseudo-centrosymmetric matrices, with applications to counting perfect matchings
We consider square matrices A that commute with a fixed square matrix K, both with entries in a field F not of characteristic 2. When K2 = I, Tao and Yasuda defined A to be generalized centrosymmetric with respect to K. When K2 = −I, we define A to be pseudo-centrosymmetric with respect to K; we show that the determinant of every even-order pseudo-centrosymmetric matrix is the sum of two square...
متن کاملThe Inverse Problem of Centrosymmetric Matrices with a Submatrix Constraint
By using Moore-Penrose generalized inverse and the general singular value decomposition of matrices, this paper establishes the necessary and sufficient conditions for the existence of and the expressions for the centrosymmetric solutions with a submatrix constraint of matrix inverse problem AX = B. In addition, in the solution set of corresponding problem, the expression of the optimal approxi...
متن کاملInverse eigenproblem for centrosymmetric and centroskew matrices and their approximation
In this paper, we first give the solvability condition for the following inverse eigenproblem (IEP): given a set of vectors {xi}i=1 in Cn and a set of complex numbers {λi}i=1, find a centrosymmetric or centroskew matrix C in Rn×n such that {xi}i=1 and {λi}i=1 are the eigenvectors and eigenvalues of C respectively. We then consider the best approximation problem for the IEPs that are solvable. M...
متن کاملOn The Pfaffians and Determinants of Some Skew-Centrosymmetric Matrices
This paper shows that the Pfaffians and determinants of some skew centrosymmet-ric matrices can be computed by a paired two-term recurrence relation, or a general number sequence of second order. As a result, the complexities of the formulas are of order n. Furthermore, the formulas have no divisions at all, i.e., they fall into the class of breakdown-free algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2003
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(02)00567-0